Evolutionary Search for Cellular Automata Logic Gates with Collision-Based Computing

We aim to search for cellular automata candidates using an automatic system for the demonstration of collision-based universality. Some of these candidates are able to simulate Turing machines in their space-time dynamics using gliders and glider guns. In this paper, we present an evolutionary algorithm that searches for the simulation of a logic gate by cellular automata. Different parameters are tried and other search techniques are also presented to provide a benchmark. Results show how a large number of simulations of logic gates were found.